Non-cryptographic Primitive for Pseudorandom Permutation
نویسندگان
چکیده
Four round Feistel permutation (like DES) is super-pseudorandom if each round function is random or a secret universal hash function. A similar result is known for five round MISTY type permutation. It seems that each round function must be at least either random or secret in both cases. In this paper, however, we show that the second round permutation g in five round MISTY type permutation need not be cryptographic at all, i.e., no randomness nor secrecy is required. g has only to satisfy that g(x) ⊕ x 6= g(x) ⊕ x for any x 6= x. This is the first example such that a non-cryptographic primitive is substituted to construct the minimum round super-pseudorandom permutation. Further we show efficient constructions of super-pseudorandom permutations by using above mentioned g.
منابع مشابه
Efficient Length Doubling From Tweakable Block Ciphers
We present a length doubler, LDT, that turns an n-bit tweakable block cipher into an efficient and secure cipher that can encrypt any bit string of length [n..2n − 1]. The LDT mode is simple, uses only two cryptographic primitive calls (while prior work needs at least four), and is a strong length-preserving pseudorandom permutation if the underlying tweakable block ciphers are strong tweakable...
متن کاملThe Design Space of Lightweight Cryptography
For constrained devices, standard cryptographic algorithms can be too big, too slow or too energy-consuming. The area of lightweight cryptography studies new algorithms to overcome these problems. In this paper, we will focus on symmetric-key encryption, authentication and hashing. Instead of providing a full overview of this area of research, we will highlight three interesting topics. Firstly...
متن کاملOn Foundation and Construction of Physical Unclonable Functions
Physical Unclonable Functions (PUFs) have been introduced as a new cryptographic primitive, and whilst a large number of PUF designs and applications have been proposed, few studies has been undertaken on the theoretical foundation of PUFs. At the same time, many PUF designs have been found to be insecure, raising questions about their design methodology. Moreover, PUFs with efficient implement...
متن کاملQuasi - Cryptography
We propose the study of quasi-cryptographic primitives and protocols. These are relaxed versions of standard cryptographic primitives and protocols where the adversary may be given more resources than some of the honest parties. The purpose of this study is to obtain a better understanding of some of the obstacles in basing cryptography on NP-hardness, as well as the relations between various c...
متن کاملFarfalle: parallel permutation-based cryptography
In this paper, we introduce Farfalle, a newmode for building a pseudorandom function (PRF) from a b-bit cryptographic permutation. The constructed PRF takes as input a b-bit key and a sequence of variable-length data strings, and it generates a variable-length output. It consists of a compression layer and an expansion layer, each of them involving the parallel application of the permutation. T...
متن کامل